Explanation in DL-Lite
نویسندگان
چکیده
The paper addresses the problem of explaining some reasoning tasks associated with the DL-Lite Description Logic. Because of the simplicity of the language, standard concept level reasoning is quite easy, and the only contribution is an alternate, more accessible syntax, plus a novel focus on brevity of proofs. Of greater interest is the explanation of reasoning in finite models, which is motivated by the use of DL-Lite for database access. The fame of DL-Lite rests on its ability to answer efficiently conjunctive queries over KBs, and the paper makes three contributions in this regard: (1) a method for explaining why a value b was returned by a query; (2) a method for finding minimal explanations for why a conjunctive query is unsatisfiable; (3) the beginnings of a theory for explaining why a value b was not returned by a query.
منابع مشابه
Explanation in the DL-LiteFamily of Description Logics
In ontology-based data access (OBDA), access to (multiple) incomplete data sources is mediated by a conceptual layer constituted by an ontology. In such a setting, to correctly compute answers to queries, it is necessary to perform complex reasoning over the constraints expressed by the ontology. We consider the case of ontologies expressed in DL-Lite, a family of DLs that, in the context of OB...
متن کاملPrediction and Explanation over DL-Lite Data Streams
Stream reasoning is an emerging research area focusing on the development of reasoning techniques applicable to streams of rapidly changing, semantically enhanced data. In this paper, we consider data represented in Description Logics from the popular DL-Lite family, and study the logic foundations of prediction and explanation over DL-Lite data streams, i.e., reasoning from finite segments of ...
متن کاملNon Defeated-Based Repair in Possibilistic DL-Lite Knowledge Bases
Possibilistic DL-Lite is an extension of the DL-Lite framework to deal with uncertain pieces of information. In this paper, we deal with inconsistency in DL-Lite in case where the assertions are uncertain and encoded in a possibility theory framework. We investigate three inconsistency-tolerant reasoning methods for possibilistic DL-Lite knowledge bases which are based on the selection of one c...
متن کاملCapturing Instance Level Ontology Evolution for DL-Lite
Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) proved its importance. Recent studies of the topic mostly focussed on model-based approaches (MBAs), where an evolution (of a KB) results in a set of models. For KBs expressed in tractable DLs, such as DL-Lite, it was shown that the evolution suffers from inexpressibility, i.e., the result of evolution cannot be expressed ...
متن کاملThe Complexity of Conjunctive Query Abduction in DL-Lite
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the explanation of both TBox reasoning and, more recently, query answering. Besides explaining the presence of a tuple in a query answer, it is important to explain also why a given tuple is missing. We address this latt...
متن کامل